Randomized Parallel Algorithms for Combinatorial Optimization
نویسندگان
چکیده
In this paper we show some important randomization techniques for the parallel processing of discrete problems. In particular, we present several parallel randomized algorithms frequently used for sorting, packet routing, shortest paths problems, matching problems, depth rst search, minimum cost spanning trees, and maximal independent set problems. We also discuss the connection between randomization and approximation, showing how randomization yields approximate solutions and we illustrate this connection by means of network ow problems.
منابع مشابه
Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementation of genetic algorithms, simulated annealing, tabu search, and greedy randomized adaptive search procedures (GRASP) are discussed.
متن کاملRandomized Parallel Algorithms for the Multidimensional Assignment Problem
The Multidimensional Assignment Problem (MAP) is a combinatorial optimization problem arising in diverse applications such as computer vision and motion tracking. In the MAP, the objective is to match tuples of objects with minimum total cost. Randomized parallel algorithms are proposed to solve MAPs appearing in Multi-Sensor Multi-Target applications. A parallel construction heuristic is descr...
متن کاملDeterministic parallel algorithms for bilinear objective functions
Many randomized algorithms can be derandomized efficiently using either the method of conditional expectations or probability spaces with low independence. A series of papers, beginning with work by Luby (1988), showed that in many cases these techniques can be combined to give deterministic parallel (NC) algorithms for a variety of combinatorial optimization problems, with low time- and proces...
متن کاملRandomized parallel algorithms
1 Outline of the chapter Advances in modern circuit technology have made parallel computation an intriguing possibility, pushing the limits of what can pratically be computed. Relevant applications of parallel computing have been succesfully developped in the eld of combinatorial optimization. Unfortunately, the theory of computational complexity has established that several relevant problems i...
متن کاملEfficient Approximation Algorithms for Scheduling Unrelated Parallel Machines
Scheduling n independent jobs on m Unrelated Parallel Machines (SUM) is the problem of assigning n jobs j = 1, .., n to m machines i = 1, .., m so that each job is processed without interruption on one of the machines, and at any time, every machine processes at most one job. The objective is to minimize the makespan of the schedule. SUM is an NP-hard problem even when the number of machines is...
متن کامل